Controlled Markov chains with constraints
نویسندگان
چکیده
منابع مشابه
Controlled Markov chains with safety upper bound
In this paper we introduce and study the notion of safety control of stochastic discrete event systems (DESs), modeled as controlled Markov chains. For non-stochastic DESs, modeled by state machines or automata, safety is specified as a set of forbidden states, or equivalently by a binary valued vector that imposes an upper bound on the set of states permitted to be visited. We generalize this ...
متن کاملMaximally Reliable Markov Chains Under Energy Constraints
Signal-to-noise ratios in physical systems can be significantly degraded if the outputs of the systems are highly variable. Biological processes for which highly stereotyped signal generations are necessary features appear to have reduced their signal variabilities by employing multiple processing steps. To better understand why this multistep cascade structure might be desirable, we prove that...
متن کاملUpdating, Transition Constraints and Possibilistic Markov Chains
Possibility theory is applied to the updating problem in a knowledge base that describes the state of an evolving system. The system evolution is described by a possibilistic Markov chain whose agreement with the axioms of updating is examined. Then it is explained how to recover a possibilistic Markov chain from a set of transition constraints, on the basis of a specificity ordering.
متن کاملTime-Sharing Policies for Controlled Markov Chains
We propose a class of non-stationary policies called \policy time sharing" (p.t.s.), which possess several desirable properties for problems where the criteria are of the average-cost type; an optimal policy exists within this class, the computation of optimal policies is straightforward, and the implementation of this policy is easy. While in the nite state case stationary policies are also kn...
متن کاملControlled Markov Chains, Graphs, and Hamiltonicity
This manuscript summarizes a line of research that maps certain classical problems of discrete mathematics — such as the Hamiltonian Cycle and the Traveling Salesman Problems — into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1990
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02811335